A New Interpretation of Amdahl's Law and Geometric Scalability
نویسنده
چکیده
The multiprocessor effect refers to the loss of computing cycles due to processing overhead. Amdahl’s law and the Multiprocessing Factor (MPF) are two scaling models used in industry and academia for estimating multiprocessor capacity in the presence of this multiprocessor effect. Both models express different laws of diminishing returns. Amdahl’s law identifies diminishing processor capacity with a fixed degree of serialization in the workload, while the MPF model treats it as a constant geometric ratio. The utility of both models for performance evaluation stems from the presence of a single parameter that can be determined easily from a small set of benchmark measurements. This utility, however, is marred by a dilemma. The two models produce different results, especially for large processor configurations that are so important for today’s applications. The question naturally arises: Which of these two models is the correct one to use? Ignoring this question merely reduces capacity prediction to arbitrary curve-fitting. Removing the dilemma requires a dynamical interpretation of these scaling models. We present a physical interpretation based on queueing theory and show that Amdahl’s law corresponds to synchronous queueing in a bus model while the MPF model belongs to a Coxian server model. The latter exhibits unphysical effects such as sublinear response times hence, we caution against its use for large multiprocessor configurations.
منابع مشابه
Scalable Problems and Memory-bounded Speedup Scalable Problems and Memory-bounded Speedup
In this paper three models of parallel speedup are studied. They are xed-size speedup, xed-time speedup and memory-bounded speedup. The latter two consider the relationship between speedup and problem scalability. Two sets of speedup formulations are derived for these three models. One set considers uneven workload allocation and communication overhead, and gives more accurate estimation. Anoth...
متن کاملReevaluating Amdahl's law in the multicore era
Microprocessor architecture has entered the multicore era. Recently, Hill and Marty presented a pessimistic view of multicore scalability. Their analysis was based on Amdahl’s law (i.e. fixed-workload condition) and challenged readers to develop bettermodels. In this study,we analyzemulticore scalability under fixed-time andmemory-bound conditions and from the data access (memorywall) perspecti...
متن کاملPerformance Prediction for Processors and External Resources
Regular forms of Amdahl’s law and the universal scalability model are functions of the number of processors p alone, therefore modelling only data sets with a single machine varying in its processor count. This paper demonstrates how these performance models can be expressed in terms of intrinsic machine characteristics such as: processor clock; external resource access speed; total threads; et...
متن کاملGetting in the Zone for Successful Scalability
The universal scalability law (USL) is an analytic model used to quantify application scaling. It is universal because it subsumes Amdahl’s law and Gustafson linearized scaling as special cases. Using simulation, we show: (i) that the USL is equivalent to synchronous queueing in a load-dependent machine repairman model and (ii) how USL, Amdahl’s law and Gustafson scaling can be regarded as boun...
متن کاملA General Theory of Computational Scalability Based on Rational Functions
The universal scalability law (USL) of computational capacity is a rational function Cp = P (p)/Q(p) with P (p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has been long used for statistical modeling and prediction of computer system performance. We prove that Cp is equivalent to the synchronous throughput bound for a machine-repairman wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.DC/0210017 شماره
صفحات -
تاریخ انتشار 2002